#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <map>
#include <climits>


using namespace std;

//10-1
class Solution1 {
    int N=1e9+7;
    vector<int> v;
public:
    Solution1(){
        v=vector<int>(101,0);
        v[0]=0;v[1]=1;
        for(int i=2;i<=100;i++){
            v[i]=(v[i-1]+v[i-2])%N;
        }
    }
    int fib(int n) {

        return v[n]; 
    }
};


//10-2
class Solution {
    int N=1e9+7;
    vector<int> v;
public:
    Solution(){
        v=vector<int>(101,0);
        v[0]=1;v[1]=1;
        for(int i=2;i<=100;i++){
            v[i]=(v[i-1]+v[i-2])%N;
        }
    }
    int numWays(int n) {

        return v[n]; 
    }
};

int main(){
    freopen("out.txt","w",stdout);
    Solution s;
    for(int i=0;i<=101;i++){
        cout << s.numWays(i) <<",";
    }




    return 0;
}